An inertial Censor-Segal algorithm for split common fixed-point problems
نویسندگان
چکیده
منابع مشابه
Multidirectional hybrid algorithm for the split common fixed point problem and application to the split common null point problem
In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. ...
متن کاملStrong Convergence Algorithm for Split Equilibrium Problems and Hierarchical Fixed Point Problems
The purpose of this paper is to investigate the problem of finding the approximate element of the common set of solutions of a split equilibrium problem and a hierarchical fixed point problem in a real Hilbert space. We establish the strong convergence of the proposed method under some mild conditions. Several special cases are also discussed. Our main result extends and improves some well-know...
متن کاملViscosity Iterative Schemes for Finding Split Common Solutions of Variational Inequalities and Fixed Point Problems
and Applied Analysis 3 where S1 is a nonexpansive mapping. They proved that the sequence {xn} defined by 1.6 strongly converge to x∗ ∈ F S1 ⋂ VI C, T , if the coefficient αn, λn satisfy the following conditions:
متن کاملViscosity approximation methods for the multiple-set split equality common fixed-point problems of demicontractive mappings
In this paper, we consider a new parallel algorithm combining viscosity approximation methods to approximate the multiple-set split common fixed point problem governed by demicontractive mappings, and get the generated sequence converges strongly to a solution of this problem. The results obtained in this paper generalize and improve the recent ones announced by many others. c ©2017 All rights ...
متن کاملCircumscribed ellipsoid algorithm for fixed-point problems
We present a new implementation of the almost optimal Circumscribed Ellipsoid (CE) Algorithm for approximating fixed points of nonexpanding functions, as well as of functions that may be globally expanding, however, are nonexpanding/contracting in the direction of fixed points. Our algorithm is based only on function values, i.e., it does not require computing derivatives of any order. We utili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory
سال: 2021
ISSN: ['1583-5022', '2066-9208']
DOI: https://doi.org/10.24193/fpt-ro.2021.1.07